Mirror Routing for Satellite Networks With Cross-layer Optimization
نویسندگان
چکیده
Several strategies have been proposed for routing in the Low Earth Orbit (LEO) satellite networks. The multi-layered routing approaches are envisioned as promising because they use Middle Earth Orbit (MEO) satellite to extend the LEO satellite network’s communication capabilities. The previously proposed multi-layered routing approaches, however, still assume that the satellites in the same layer share similar characteristics. This assumption is not true in the future satellite networks. This is because the satellites in the future will be heterogeneous with various computation, communication and power capacities that lead to more complicated route construction challenges. In order to solve this problem, we propose the usage of cross-layer designs that can collect information from the neighboring satellites and evaluate their capacity during route construction and maintenance phases. This paper first analyzes the advantages and disadvantages of different satellite routing approaches. Then a multi-layered routing scheme called Mirrored Routing with Cross-layer optimization (MRCL) is introduced. In order to reduce overhead caused by the routing scheme, a hop count limitation, instead of a strict grouping policy, is used to direct packets to the MEO layer. According to our simulations, the end-to-end delay can be reduced 15% when a proper hop count limitation is selected. The novel routing scheme also significantly reduces the packet loss and the routing overhead (in terms of bytes of routing information) compared to the routing without cross-layer optimization and hop limitation. We also simulate and careful investigate the performance of MRCL using various hop count limitation configuration.
منابع مشابه
Study and Implementation of Cross Layer Design Based Routing Algorithm for Leo Satellite Network
Now a days Low earth orbit satellite networks are used to provide global coverage to users in remote areas. Since LEO’s are continuously revolving, they traverse their orbits and thus cause frequent user handovers. So for providing better service to the user and improving the LEO satellite network performance a Cross-layer design and Ant-colony optimization based Loadbalancing routing algorithm...
متن کاملDecentralized Routing and Power Allocation in FDMA Wireless Networks based on H∞ Fuzzy Control Strategy
Simultaneous routing and resource allocation has been considered in wireless networks for its performance improvement. In this paper we propose a cross-layer optimization framework for worst-case queue length minimization in some type of FDMA based wireless networks, in which the the data routing and the power allocation problem are jointly optimized with Fuzzy distributed H∞ control strategy ....
متن کاملA New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm
Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...
متن کاملCross-Layer Designs Architecture for LEO Satellite Ad Hoc Network
Future Low Earth Orbit (LEO) satellite networks are envisioned as distributed architectures of autonomous data processing nodes. Such ad hoc networks should deliver reliable communication channels for control commands and data among ground stations and satellites minimizing delay and power. The LEO satellite networks are different from the generic ad hoc scenario. In this paper, we first analyz...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کامل